GenAnneal : Genetically modified Simulated Annealing ✩ Ioannis
نویسندگان
چکیده
A modification of the standard Simulated Annealing (SA) algorithm is presented for finding the global minimum of a continuous multidimensional, multimodal function. We report results of computational experiments with a set of test functions and we compare to methods of similar structure. The accompanying software accepts objective functions coded both in Fortran 77 and C++.
منابع مشابه
GenAnneal: Genetically modified Simulated Annealing
A modification of the standard Simulated Annealing (SA) algorithm is presented for finding the global minimum of a continuous multidimensional, multimodal function. We report results of computational experiments with a set of test functions and we compare to methods of similar structure. The accompanying software accepts objective functions coded both in Fortran 77 and C++. PACS::02.60.-x ; 02....
متن کاملSequencing Mixed Model Assembly Line Problem to Minimize Line Stoppages Cost by a Modified Simulated Annealing Algorithm Based on Cloud Theory
This research presents a new application of the cloud theory-based simulated annealing algorithm to solve mixed model assembly line sequencing problems where line stoppage cost is expected to be optimized. This objective is highly significant in mixed model assembly line sequencing problems based on just-in-time production system. Moreover, this type of problem is NP-hard and solving this probl...
متن کاملAbstract of " Simulated Annealing Based Local Search for Sport Scheduling Problems " by Ioannis Simulated Annealing Based Local Search for Sport Scheduling Problems
of “Simulated Annealing Based Local Search for Sport Scheduling Problems” by Ioannis Vergados, Ph.D., Brown University, May 2007. Sport Scheduling is an important area of Combinatorial Optimization of great practical and theoretical significance, that features some extremely challenging optimization problems. This thesis focuses on two important sport scheduling problems: the Break Minimization...
متن کاملModified Discrete-State Simulated Annealing and Simulated Tempering in TWTA Ideal Collector Design
This article introduces a new variant on the popular optimization method, simulated annealing, herein called modified discrete-state simulated annealing. A guide in practical implementation of simulated tempering is also provided. The algorithms are tested in the design of an ideal collector for a travelling wave tube amplifier. keywords: simulated annealing, simulated tempering, travelling wav...
متن کاملEnhanced Simulated Annealing Techniques for Multiprocessor Scheduling
The problem of multiprocessor scheduling can be stated as scheduling a general task graph on a multiprocessor system such that a set of performance criteria will be optimized. This study investigates the use of near optimal scheduling strategies in multiprocessor scheduling problem. The multiprocessor scheduling problem is modeled and simulated using five different simulated annealing algorithm...
متن کامل